Optimal guessing under nonextensive framework and associated moment bounds
نویسندگان
چکیده
We consider the problem of guessing realization a random variable but under more general Tsallis’ non-extensive entropic framework rather than classical Maxwell–Boltzman–Gibbs–Shannon framework. both conditional in presence some related side information, and unconditional one where no such side-information is available. For types problem, moment bounds required number guesses are derived; here we use q-normalized expectation place usual (linear) to define moments. These seen be function logarithmic norm entropy measure, recently developed two-parameter generalization Renyi entropy, hence provide their information theoretic interpretation. have also considered case uncertain source distribution derived for corresponding mismatched function. interestingly linked with an important robust statistical divergence family known as relative (α,β)-entropies; similar link discussed between optimum extremes these measures.
منابع مشابه
OPTIMAL DESIGN OF COLUMNS FOR AN INTERMEDIATE MOMENT FRAME UNDER UNIAXIAL MOMENT AND AXIAL LOADS
The present study addresses optimal design of reinforced concrete (RC) columns based on equivalent equations considering deformability regulations of ACI318-14 under axial force and uniaxial bending moment. This study contrary to common approaches working with trial and error approach in design, at first presents an exact solution for intensity of longitudinal reinforcement in column section by...
متن کاملImproving Models of Slipping, Guessing, and Moment-By-Moment Learning with Estimates of Skill Difficulty
Over the past several years, several extensions to Bayesian knowledge tracing have been proposed in order to improve predictions of students’ in-tutor and post-test performance. One such extension is Contextual Guess and Slip, which incorporates machine-learned models of students’ guess and slip behaviors in order to enhance the overall model’s predictive performance [Baker et al. 2008a]. Simil...
متن کاملUniqueness of Nonextensive entropy under Renyi's Recipe
By replacing linear averaging in Shannon entropy with Kolmogorov-Nagumo average (KN-averages) or quasilinear mean and further imposing the additivity constraint, Rényi proposed the first formal generalization of Shannon entropy. Using this recipe of Rényi, one can prepare only two information measures: Shannon and Rényi entropy. Indeed, using this formalism Rényi characterized these additive en...
متن کاملA Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
We provide an optimization framework for computing optimal upper and lower bounds on functional expectations of distributions with special properties, given moment constraints. Bertsimas and Popescu have already shown how to obtain optimal moment inequalities for arbitrary distributions via semidefinite programming. These bounds are not sharp if the underlying distributions possess additional s...
متن کاملOptimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means
We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2023
ISSN: ['1879-2103', '0167-7152']
DOI: https://doi.org/10.1016/j.spl.2023.109812